Energy Minimization and Relaxation Labeling

نویسندگان

  • STAN Z. LI
  • HAN WANG
  • KAP LUK CHAN
  • MARIA PETROU
چکیده

Recently, there has been increasing interest in Markov random eld (MRF) modeling for solving a variety of computer vision problems formulated in terms of the maximum a posteriori (MAP) probability. When the label set is discrete, such as in image segmentation and matching, the minimization is combinatorial. The objective of this paper is twofold: Firstly, we propose to use the continuous relaxation labeling (RL) as an alternative approach for the minimization. The motivation is that it provides a good compromise between the solution quality and the computational cost. We show how the original combinatorial optimization can be converted into a form suitable for continuous RL. Secondly, we compare various minimization algorithms, namely, the RL algorithms proposed by Rosenfeld et al. and by Hummel and Zucker, the mean eld annealing of Peterson and Soderberg, simulated annealing of Kirkpatrick, the iterative conditional modes (ICM) of Besag and an annealing version of ICM proposed in this paper. The comparisons are in terms of the minimized energy value (i.e. the solution quality), the required number of iterations (i.e. the computational cost), and also the dependence of each algorithm on heuristics.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Feature binding and relaxation labeling with the competitive layer model

We discuss the relation of the Competitive Layer Model (CLM) to Relaxation Labeling (RL) with regard to feature binding and labeling problems. The CLM uses cooperative and competitive interactions to partition a set of input features into groups by energy minimization. As we show, the stable attractors of the CLM provide consistent and unambiguous labelings in the sense of RL and we give an eff...

متن کامل

Rounding-based Moves for Semi-Metric Labeling

Semi-metric labeling is a special case of energy minimization for pairwise Markov random fields. The energy function consists of arbitrary unary potentials, and pairwise potentials that are proportional to a given semi-metric distance function over the label set. Popular methods for solving semi-metric labeling include (i) move-making algorithms, which iteratively solve a minimum st-cut problem...

متن کامل

Rounding-based Moves for Metric Labeling

Metric labeling is a special case of energy minimization for pairwise Markov random fields. The energy function consists of arbitrary unary potentials, and pairwise potentials that are proportional to a given metric distance function over the label set. Popular methods for solving metric labeling include (i) move-making algorithms, which iteratively solve a minimum st-cut problem; and (ii) the ...

متن کامل

Relaxation Labeling of Markov Random Fields

Using Markov random eld (MRF) theory, a variety of computer vision problems can be modeled in terms of optimization based on the maximum a poste-riori (MAP) criterion. The MAP connguration minimizes the energy of a posterior (Gibbs) distribution. When the label set is discrete, the minimization is combinatorial. This paper proposes to use the continuous relaxation labeling (RL) method for the m...

متن کامل

How Hard Is the LP Relaxation of the Potts Min-Sum Labeling Problem?

An important subclass of the min-sum labeling problem (also known as discrete energy minimization or valued constraint satisfaction) is the pairwise min-sum problem with arbitrary unary costs and attractive Potts pairwise costs (also known as the uniform metric labeling problem). In analogy with our recent result, we show that solving the LP relaxation of the Potts min-sum problem is not signif...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997